A genetic algorithm for solving bus terminal location problem using data envelopment analysis with multi-objective programming

نویسندگان

چکیده

Due to the urban expansion and population increasing, bus network design is an important problem in public transportation. Functional aspect of networks such as fuel consumption depreciation buses also spatial aspects station terminal locations or access rate are not proper conditions most cities. Therefore, having efficient method evaluate performance lines by considering both functional essential. In this paper, we propose a new model for location using data envelopment analysis with multi-objective programming approach. model, want find allocation patterns assigning stations terminals, investigate optimal deploying terminals. Hence, use genetic algorithm solving our model. By simultaneous combination problem, two types efficiencies optimized: Spatial efficiency measured finding serving amount terminals’ demands score selected patterns. This approach useful when one criteria choosing terminals decision-makers.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Bus Terminal Location Problem Using Simulated Annealing Method

Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm. ...

متن کامل

Solving Bus Terminal Location Problem Using Simulated Annealing Method

Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm.&...

متن کامل

Using Genetic Algorithm in Solving Stochastic Programming for Multi-Objective Portfolio Selection in Tehran Stock Exchange

Investor decision making has always been affected by two factors: risk and returns. Considering risk, the investor expects an acceptable return on the investment decision horizon. Accordingly, defining goals and constraints for each investor can have unique prioritization. This paper develops several approaches to multi criteria portfolio optimization. The maximization of stock returns, the pow...

متن کامل

Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm

This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Operations Research

سال: 2021

ISSN: ['1572-9338', '0254-5330']

DOI: https://doi.org/10.1007/s10479-021-04244-4